翻訳と辞書 Words near each other ・ Capcom Cup ・ Capcom Digital Collection ・ Capcom Fighting All-Stars ・ Capcom Fighting Evolution ・ Capcom Five ・ Capcom Generations ・ Capcom Platinum Hits Triple Pack ・ Capaci ・ Capacitance ・ Capacitance Electronic Disc ・ Capacitance meter ・ Capacitance multiplier ・ Capacitance of blood vessels ・ Capacitance probe ・ Capacitance–voltage profiling ・ Capacitated minimum spanning tree ・ Capacitation ・ Capacities (album) ・ Capacitive coupling ・ Capacitive deionization ・ Capacitive displacement sensor ・ Capacitive micromachined ultrasonic transducers ・ Capacitive power supply ・ Capacitive sensing ・ Capacitively coupled plasma ・ Capacitor ・ Capacitor analogy ・ Capacitor discharge ignition ・ Capacitor discharge sintering ・ Capacitor plague Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Capacitated minimum spanning tree ： ウィキペディア英語版 Capacitated minimum spanning tree Capacitated minimum spanning tree is a minimal cost spanning tree of a graph that has a designated root node $r$ and satisfies the capacity constraint $c$. The capacity constraint ensures that all subtrees (maximal subgraphs connected to the root by a single edge) incident on the root node $r$ have no more than $c$ nodes. If the tree nodes have weights, then the capacity constraint may be interpreted as follows: the sum of weights in any subtree should be no greater than $c$. The edges connecting the subgraphs to the root node are called ''gates''. Finding the optimal solution is NP-hard. == Algorithms == Suppose we have a graph $G\; =\; (V,\; E)$, $n\; =\; |G|$ with a root $r\; \backslash in\; G$. Let $a\_$ be all other nodes in $G$. Let $c\_$ be the edge cost between vertices $a\_$ and $a\_$ which form a cost matrix $C\; =\; \{c\_\{ij\}\}$. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Capacitated minimum spanning tree」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.